Post-processing of the oblivious key in quantum private queries
نویسندگان
چکیده
Quantum private query (QPQ) is a kind of quantum protocols to protect both users’ privacy in their communication. There is an interesting example, that is, Alice wants to buy one item from Bob’s database, which is composed of a quantity of valuable messages. QPQ protocol is the communication procedure ensuring that Alice can get only one item from Bob, and at the same time, Bob cannot know which one was taken by Alice. Owing to its practicability, quantum-keydistribution-based QPQ has draw much attention in recent years. However, the post-processing of the key in such protocols, called oblivious key, remains far from being satisfactorily known. Especially, the error correction method for such special key is still missing. Here we focus on the post-processing of the oblivious key, including both dilution and error correction. On the one hand, we demonstrate that the previous dilution method, which greatly reduces the communication complexity, will bring Alice the chance to illegally obtain much additional information about Bob’s database. Simulations show that by very limited queries Alice can obtain the whole database. On the other hand, we present an effective error-correction method for the oblivious key, which completes its post-processing and makes such QPQ more practical.
منابع مشابه
A Scheme for Collaboratively Processing Nearest Neighbor Queries in Oblivious Storage
Security concerns are a substantial impediment to the wider deployment of cloud storage. There are two main concerns on the confidentiality of outsourced data: i) protecting the data, and ii) protecting the access pattern (i.e., which data is being accessed). To mitigate these concerns, schemes for Oblivious Storage (OS) have been proposed. In OS, the data owner outsources a key-value store to ...
متن کاملOblivious Transfer from Weakly Random Self-Reducible Public-Key Cryptosystem
In this work, we define a new notion of weakly Random-Self-Reducibile cryptosystems and show how it can be used to implement secure Oblivious Transfer. We also show that two recent (Post-quantum) cryptosystems (based on Learning with errors and Approximate Integer GCD) can be considered as weakly Random-Self-Reducible.
متن کاملOblix: An Efficient Oblivious Search Index
Search indices are fundamental building blocks of many systems, and there is great interest in running them on encrypted data. Unfortunately, many known schemes that enable search queries on encrypted data achieve efficiency at the expense of security, as they reveal access patterns to the encrypted data. In this paper we present Oblix, a search index for encrypted data that is oblivious (prova...
متن کاملSmall private keys for systems of multivariate quadratic equations using symmetric cryptography
Systems of Multivariate Quadratic Equations (M Q ) are important in cryptography due to the resistance against attacks that will arise with the advent of quantum computing. Resistant algorithms against attacks based on quantum computing are called post-quantum cryptography. Unbalanced OilVinegar (UOV) is a well known post-quantum signature scheme based on M Q . This paper presents a variation o...
متن کاملPerforming private database queries in a real-world environment using a quantum protocol
In the well-studied cryptographic primitive 1-out-of-N oblivious transfer, a user retrieves a single element from a database of size N without the database learning which element was retrieved. While it has previously been shown that a secure implementation of 1-out-of-N oblivious transfer is impossible against arbitrarily powerful adversaries, recent research has revealed an interesting class ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/1406.0589 شماره
صفحات -
تاریخ انتشار 2014